Dependently-typed data plane programming

Programming languages like P4 enable specifying the behavior of network data planes in software. However, with increasingly powerful and complex applications running network, risk faults also increases. Hence, there is growing recognition need for methods tools to statically verify correctness code, especially as language lacks basic safety guarantees. Type systems are a lightweight compositional way establish program properties, but significant gap between kinds properties that can be proved using simple type (e.g., SafeP4) those obtained full-blown verification p4v). In this paper, we close by developing $\Pi$4, dependently-typed version based on decidable refinements. We motivate design prove soundness its system, develop an SMT-based implementation, present case studies illustrate applicability variety plane programs.